BCCC Disjoint Path Construction Algorithm and Fault-Tolerant Routing Algorithm under Restricted Connectivity

Connectivity in large-scale data center networks is a critical indicator to evaluate network state. A feasible and performance-guaranteed algorithm enables us find disjoint paths between vertices ensure effective transfer maintain the normal operation of case faulty nodes. As an important network, BCube Connected Crossbars (BCCC) has many excellent properties that have been widely studied. In this paper, we first propose vertex path with time complexity O(nk) BCCC, where n denotes switch connected servers k dimension. Then, prove restricted connectivity BCCC(n,k). Finally, present O(knκ1(G)) fault-free κ1(G) connectivity. This can obtain any two distinct under condition each at least one neighbor BCCC set F |F|<κ1(G).